Partial Match Queries in Random k-d Trees
نویسندگان
چکیده
We solve the open problem of characterizing the leading constant in the asymptotic approximation to the expected cost used for random partial match queries in random k-d trees. Our approaches are new and of some generality; in particular, they are applicable to many problems involving differential equations (or difference equations) with polynomial coefficients.
منابع مشابه
Partial Match Queries in Relaxed K-dt trees
The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as opposed to random) partial match queries were studied for random relaxed K-d trees, random standard K-d trees, and random 2-dimensional quad trees. Based on those results it se...
متن کاملSquarish k-d Trees
We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensional partial match queries behave as perfectly balanced complete k-d trees on n nodes. This is in contrast to a result of Flajolet and Puech [J. Assoc. Comput. Mach., 33 (1986), pp. 371–407], who proved that for (stan...
متن کاملRandomized K-Dimensional Binary Search Trees
This paper introduces randomized K-dimensional binary search trees (randomized Kd-trees), a variant of K-dimensional binary trees. This data structure allows the ee-cient maintenance of multidimensional records for any sequence of insertions and deletions ; and thus, is fully dynamic. We show that several types of associative queries are eeciently supported by randomized Kd-trees. In particular...
متن کاملA Limit Process for Partial Match Queries in Random Quadtrees and 2-d Trees by Nicolas Broutin,
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quadtrees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the number of nodes Cn(ξ) to visit in order to report the items matching a random query ξ ,...
متن کاملA limit process for partial match queries in random quadtrees and $2$-d trees
We consider the problem of recovering items matching a partially specified pattern in multidimen-sional trees (quadtrees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the number of nodes Cn(ξ) to visit in order to report the items matching a random query ξ,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 35 شماره
صفحات -
تاریخ انتشار 2006